Optimal oblivious routing under linear and ellipsoidal uncertainty
نویسندگان
چکیده
منابع مشابه
Optimal oblivious routing under statistical uncertainty
In telecommunication networks, a common measure is the maximum congestion (i.e., utilisation) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic ...
متن کاملOblivious OSPF routing with weight optimization under polyhedral demand uncertainty
The desire for configuring well-managed OSPF routes to handle the communication needs in the contemporary business world with larger networks and changing service requirements has opened the way to use traffic engineering tools with the OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. ...
متن کاملOSPF Routing with Optimal Oblivious Performance Ratio Under Polyhedral Demand Uncertainty
We study the best OSPF style routing problem in telecommunication networks, where weight management is employed to get a routing configuration with the minimum oblivious ratio. We consider polyhedral demand uncertainty: the set of traffic matrices is a polyhedron defined by a set of linear constraints, and the performance of each routing is assessed on its worst case congestion ratio for any fe...
متن کاملEllipsoidal Estimation under Model Uncertainty
Ellipsoidal outer-bounding under model uncertainty is a natural extension of state estimation for models with unknown-but-bounded errors. The technique described in this paper applies to linear discrete-time dynamic systems. Many difficulties arise because of the non-convexity of feasible sets. Analytical optimal or suboptimal solutions are presented, which are counterparts in this context of u...
متن کاملRobust Combinatorial Optimization under Budgeted-Ellipsoidal Uncertainty∗
In the field of robust optimization uncertain data is modeled by uncertainty sets, i.e. sets which contain all relevant outcomes of the uncertain parameters. The complexity of the related robust problem depends strongly on the shape of the uncertainty set. Two popular classes of uncertainty are budgeted uncertainty and ellipsoidal uncertainty. In this paper we introduce a new uncertainty class ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization and Engineering
سال: 2007
ISSN: 1389-4420,1573-2924
DOI: 10.1007/s11081-007-9033-z